Incremental Constraint Satisfaction for Variational Design Systems 1
نویسندگان
چکیده
Variational Design is a general and powerful technique for supporting the preliminary stages of a design. It allows the coupling of engineering constraints and geometric constraints by converting them into a system of equations. Such a facility provides the user with appropriate tools to explore design alternatives during the early design stages. However, algorithms employed by the current variational modellers iteratively evaluate the entire set of equations whenever a new constraint is inserted. This hinders the interactive design performance when dealing with large constraint equation sets. The paper presents an algorithm to speed up the constraint equation solving process of a Variational Design system. Based on an incremental approach, the algorithm maintains an evolving solution by locally accommodating an inserted constraint into the previously solved equation set. Constraint cycles as well as underand over-constrained situations, which constantly emerge during the design process, are also incrementally handled by the algorithm.
منابع مشابه
Interactive Connguration Using Constraint Satisfaction Techniques
In this paper, we focus on techniques for incremental constraint-based conngu-ration with discrete and continuous variables. We show how to formalize constraint knowledge using compatibility and activity constraints (Mittal 1990) and how this knowledge is used for reasoning within an intelligent CAD system. Most technical (as opposed to spatial) constraint connguration systems use algorithms fo...
متن کاملInteractive Configuration using Constraint Satisfaction
In this paper~ we focus on techniques for incremental constraint-based configuration with discrete and continuous variables. We show how to formalize constraint knowledge using compatibility and activity constraints (Mittal 1990) and how this knowledge is used for reasoning within an intelligent CAD system. Most technical as opposed to spatial constraint configuration systems use algorithms for...
متن کاملIncremental Adaptation of Constraint Handling Rule Derivations ?
Constraint solving in dynamic environments requires an immediate adaptation of previously evaluated solutions of constraint satisfaction problems if these problems are changed. After a change, an adapted solution is preferred which is stable, i.e. as close as possible to the original solution. A wide range of incremental constraint solving methods for dynamic nite domain constraint satisfaction...
متن کاملManaging Dynamic Temporal Constraint Networks
This paper concerns the specialization of arcconsistency algorithms for constraint satisfaction in the management of quantitative temporal constraint networks. Attention is devoted to the design of algorithms that support an incremental style of building solutions allowing both constraint posting and constraint retraction. In particular, the AC-3 algorithm for constraint propagation, customized...
متن کاملConstraint satisfaction for robust parsing of spoken language
The eliminative nature of Constraint Satisfaction over nite domains o ers an interesting potential for robustness in the parsing of spoken language. An approach is presented, which puts unusually ambitious demands on the design of the Constraint Satisfaction procedure by trying to combine preferential reasoning, dynamic scheduling, parallel processing and incremental constraint solving within a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995